Cyclic graphs
نویسندگان
چکیده
منابع مشابه
Cyclic Graphs
A subclass of the class of circulant graphs is considered. It is shown that in this subclass, isomorphism is equivalent to Adam-isomorphism. Various results are obtained for the chromatic number, line-transitivity and the diameter.
متن کاملCyclic Deficiency of Graphs
A proper edge coloring of a graph G with colors 1, 2, . . . , t is called a cyclic interval t-coloring if for each vertex v of G the edges incident to v are colored by consecutive colors, under the condition that color 1 is considered as consecutive to color t. In this paper we introduce and investigate a new notion, the cyclic deficiency of a graph G, defined as the minimum number of pendant e...
متن کاملCyclic Haar graphs
For a given group with a generating set A a dipole with jAj parallel directed edges labeled by elements of A gives rise to a voltage graph whose covering graph denoted by H A is a bipartite regular graph called a bi Cayley graph In the case when is abelian we refer to H A as a Haar graph of with respect to the symbol A In particular for cyclic the above graph is referred to as a cyclic Haar gra...
متن کاملCyclic Leveling of Directed Graphs
The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and processes that repeat in a daily or weekly turn. ...
متن کاملCyclic critical groups of graphs
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00121-3